WebKB-GE - A Visual Editor for Canonical Conceptual Graphs (Research Note)

نویسندگان

  • Simon Pollitt
  • Andrew Burrow
  • Peter W. Eklund
چکیده

This paper reports a CG editor implementation which uses canonical formation as the direct manipulation metaphore. The editor is written in Java and embedded within the WekKB indexation tool. The user's mental map is explicitly supported by a separate representation of a graph's visual layout. In addition, cooperative knowledge formulation is supported by network-aware work-sharing features. The layout language and its implementation are described as well as the design and implementation features.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

WWW Indexation and Document Navigation using Conceptual Structures

WebKB is a public domain knowledge annotation toolkit allowing indices of any Document Element (DE) on the WWW to be built using annotations in a Knowledge Representation (KR) language: Conceptual Graphs. The language permits the semantic content and relationships to other DEs to be described precisely. Search can be initiated remotely, via a WWW-browser and/or other software. WebKB enables the...

متن کامل

On Conceptual Graphs and Explanation of Query Answering under Inconsistency

Conceptual Graphs are a powerful visual knowledge representation language. In this paper we are interested in the use of Conceptual Graphs in the setting of Ontology Based Data Access, and, more specifically, in reasoning in the presence of inconsistency. We present different explanation heuristics of query answering under inconsistency and show how they can be implemented under the Conceptual ...

متن کامل

A note on the first Zagreb index and coindex of graphs

Let $G=(V,E)$, $V={v_1,v_2,ldots,v_n}$, be a simple graph with$n$ vertices, $m$ edges and a sequence of vertex degrees$Delta=d_1ge d_2ge cdots ge d_n=delta$, $d_i=d(v_i)$. Ifvertices $v_i$ and $v_j$ are adjacent in $G$, it is denoted as $isim j$, otherwise, we write $insim j$. The first Zagreb index isvertex-degree-based graph invariant defined as$M_1(G)=sum_{i=1}^nd_i^2$, whereas the first Zag...

متن کامل

Basic Conceptual Structures Theory ∗ Michel

Although the theory of Conceptual Structures is over 10 years old, basic notions (like canonical graphs) are far from settled and are subject to constant extensions and reformulations. However, most of these are done in an informal way, which doesn’t help in clarifying the issues involved. It is our hope that this paper will provide a first step towards the complete and rigorous account of Conc...

متن کامل

Representing Conceptual Graphs in Algernon: Working Note 9

“Conceptual Graphs” have become a popular representational formalism in AI research. They were introduced by Sowa in his 1984 book “Conceptual Structures” [Sowa, 1984], as a modern treatment of ideas from the 19th century philosopher Peirce. Conceptual graphs are also the fundamental representational unit in KM/KQL [Clark, 1996], the language of the Botany KB project. In KM, these units are ref...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998